HNN-Extensions of Finitely Presented Soluble Groups
نویسندگان
چکیده
منابع مشابه
Finitely Presented Extensions by Free Groups
We prove here that a finitely presented group with a free quotient of rank n is an HNN-extension with n stable letters of a finitely generated group where the associated subgroups are finitely generated. This theorem has a number of consequences. In particular, in the event that the free quotient is cyclic it reduces to an elementary and quick proof of a theorem of Bieri and Strebel. 1. Finitel...
متن کاملResolving Extensions of Finitely Presented Systems
In this paper we extend certain central results of zero dimensional systems to higher dimensions. The first main result shows that if (Y, f) is a finitely presented system, then there exists a Smale space (X,F ) and a u-resolving factor map π+ : X → Y . If the finitely presented system is transitive, then we show there is a canonical minimal u-resolving Smale space extension. Additionally, we s...
متن کاملFinitely Presented Residually Free Groups
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all n ∈ N, a residually free group is of type FPn if and only if it is of type Fn. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups ...
متن کاملOn Groups which contain no HNN-Extensions
A group is called HNN-free if it has no subgroups that are nontrivial HNN-extensions. 23 We prove that finitely generated HNN-free implies virtually polycyclic for a large class of groups. We also consider finitely generated groups with no free subsemigroups of rank 2 25 and show that in many situations such groups are virtually nilpotent. Finally, as an application of our results, we determine...
متن کاملConstructing Matrix Representations of Finitely Presented Groups
The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1993
ISSN: 0021-8693
DOI: 10.1006/jabr.1993.1238